Induced matchings in strongly biconvex graphs and some algebraic applications
نویسندگان
چکیده
In this paper, motivated by a question posed H. de Alba and D. T. Hoang, we introduce strongly biconvex graphs as subclass of weakly chordal bipartite graphs. We give linear time algorithm to find an induced matching for such prove that indeed gives maximum matching. Applying algorithm, provide graph whose (monomial) edge ideal does not admit unique extremal Betti number. Using constructed graph, infinite family the so-called closed (also known proper interval graphs) binomial ideals do have This, in particular, answers aforementioned question.
منابع مشابه
Strongly maximal matchings in infinite weighted graphs
Given an assignment of weights w to the edges of an infinite graph G, a matching M in G is called strongly w-maximal if for any matching N there holds ∑ {w(e) | e ∈ N \ M} ≤ ∑ {w(e) | e ∈ M \ N}. We prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching. This result is best possible in the sense that if we allow irrational values or ...
متن کاملInduced Matchings and Induced Paths in Graphs
Denote by ∇1(G) the maximum of |E(H)| |V (H)| over all (simple) minors of G obtained by contracting a star forest. We prove that there exists a positive function such that every graph G of order n has (at least) two clones (that is two vertices with the same neighbours) or an induced matching of size at least (∇1(G))n and that this set may be found in linear time. More generally, we prove that ...
متن کاملInduced matchings in cubic graphs
In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching.
متن کاملInduced matchings in intersection graphs
An induced matching in a graph G is a set of edges, no two of which meet a common node or are joined by an edge of G; that is, an induced matching is a matching which forms an induced subgraph. Induced matchings in graph G correspond precisely to independent sets of nodes in the square of the line-graph of G, which we denote by [L(G)]. Often, if G has a nice representation as an intersection gr...
متن کاملMaximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2021
ISSN: ['1522-2616', '0025-584X']
DOI: https://doi.org/10.1002/mana.201900472